Complexity of preemptive minsum scheduling on unrelated parallel machinesSITTERS, René.Journal of algorithms (Print). 2005, Vol 57, Num 1, pp 37-48, issn 0196-6774, 12 p.Article

Batch scheduling with controllable setup and processing times to minimize total completion timeDANIEL NG, C. T; CHENG, T. C. E; KOVALYOV, M. Y et al.The Journal of the Operational Research Society. 2003, Vol 54, Num 5, pp 499-506, issn 0160-5682, 8 p.Article

Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequencesGAWIEJNOWICZ, Stanislaw; KURC, Wieslaw; PANKOWSKA, Lidia et al.Discrete applied mathematics. 2006, Vol 154, Num 15, pp 2150-2166, issn 0166-218X, 17 p.Conference Paper

Minimizing total completion time in a two-machine flow shop with deteriorating jobsWANG, Ji-Bo; NG, C. T. Daniel; CHENG, T. C. E et al.Applied mathematics and computation. 2006, Vol 180, Num 1, pp 185-193, issn 0096-3003, 9 p.Article

Single-machine group scheduling problems with deterioration considerationWU, Chin-Chia; SHIAU, Yau-Ren; LEE, Wen-Chiung et al.Computers & operations research. 2008, Vol 35, Num 5, pp 1652-1659, issn 0305-0548, 8 p.Article

Parallel-machine scheduling with time dependent processing timesKUO, Wen-Hung; YANG, Dar-Li.Theoretical computer science. 2008, Vol 393, Num 1-3, pp 204-210, issn 0304-3975, 7 p.Article

Using mixed graph coloring to minimize total completion time in job shop schedulingAL-ANZI, Fawaz S; SOTSKOV, Yuri N; ALLAHVERDI, Ali et al.Applied mathematics and computation. 2006, Vol 182, Num 2, pp 1137-1148, issn 0096-3003, 12 p.Article

Scheduling of uniform parallel machines with s-precedence constraintsKIM, Eun-Seok.Mathematical and computer modelling. 2011, Vol 54, Num 1-2, pp 576-583, issn 0895-7177, 8 p.Article

Scheduling of parallel machines to minimize total completion time subject to s-precedence constraintsKIM, Eun-Seok; SUNG, Chang-Sup; LEE, Ik-Sun et al.Computers & operations research. 2009, Vol 36, Num 3, pp 698-710, issn 0305-0548, 13 p.Article

Open shops with jobs overlap: revisitedLEUNG, Joseph Y-T; HAIBING LI; PINEDO, Michael et al.European journal of operational research. 2005, Vol 163, Num 2, pp 569-571, issn 0377-2217, 3 p.Article

New heuristics for m-machine no-wait flowshop to minimize total completion timeALDOWAISAN, Tariq; ALLAHVERDI, Ali.Omega (Oxford). 2004, Vol 32, Num 5, pp 345-352, issn 0305-0483, 8 p.Article

Minimizing the total completion time in single-machine scheduling with step-deteriorating jobsJENG, A. A. K; LIN, B. M. T.Computers & operations research. 2005, Vol 32, Num 3, pp 521-536, issn 0305-0548, 16 p.Article

Rescheduling problems with deteriorating jobs under disruptionsCHUANLI ZHAO; HENGYONG TANG.Applied mathematical modelling. 2010, Vol 34, Num 1, pp 238-243, issn 0307-904X, 6 p.Article

Pareto and scalar bicriterion optimization in scheduling deteriorating jobsGAWIEJNOWICZ, S; KURC, W; PANKOWSKA, L et al.Computers & operations research. 2006, Vol 33, Num 3, pp 746-767, issn 0305-0548, 22 p.Article

A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion timeSADYKOV, Ruslan.Computers & operations research. 2012, Vol 39, Num 6, pp 1265-1270, issn 0305-0548, 6 p.Article

Minimizing the total completion time in a single-machine scheduling problem with a learning effectLOW, Chinyao; LIN, Wen-Yi.Applied mathematical modelling. 2011, Vol 35, Num 4, pp 1946-1951, issn 0307-904X, 6 p.Article

Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effectsHSU, Chou-Jung; KUO, Wen-Hung; YANG, Dar-Li et al.Applied mathematical modelling. 2011, Vol 35, Num 3, pp 1492-1496, issn 0307-904X, 5 p.Article

A new heuristic for open shop total completion time problemLIXIN TANG; DANYU BAI.Applied mathematical modelling. 2010, Vol 34, Num 3, pp 735-743, issn 0307-904X, 9 p.Article

Online scheduling on m uniform machines to minimize total (weighted) completion timeMING LIU; CHENGBIN CHU; YINFENG XU et al.Theoretical computer science. 2009, Vol 410, Num 38-40, pp 3875-3881, issn 0304-3975, 7 p.Article

Minimizing total completion time on parallel machines with deadline constraintsLEUNG, Joseph Y.-T; PINEDO, Michael.SIAM journal on computing (Print). 2003, Vol 32, Num 5, pp 1370-1388, issn 0097-5397, 19 p.Article

Bicriteria scheduling in a two-machine permutation flowshopLIN, B. M. T; WU, J. M.International journal of production research. 2006, Vol 44, Num 12, pp 2299-2312, issn 0020-7543, 14 p.Article

An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints : IEPM: Focus on schedulingSADFI, Cherif; PENZ, Bernard; RAPINE, Christophe et al.European journal of operational research. 2005, Vol 161, Num 1, pp 3-10, issn 0377-2217, 8 p.Conference Paper

A note on single-machine group scheduling problems with position-based learning effectLEE, Wen-Chiung; WU, Chin-Chia.Applied mathematical modelling. 2009, Vol 33, Num 4, pp 2159-2163, issn 0307-904X, 5 p.Article

A bi-criteria two-machine flowshop scheduling problem with a learning effectCHEN, P; WU, C.-C; LEE, W.-C et al.The Journal of the Operational Research Society. 2006, Vol 57, Num 9, pp 1113-1125, issn 0160-5682, 13 p.Article

A note on unrelated parallel machine scheduling with time-dependent processing timesKUO, W-H; HSU, C-J; YANG, D-L et al.The Journal of the Operational Research Society. 2009, Vol 60, Num 3, pp 431-434, issn 0160-5682, 4 p.Article